#include<bits/stdc++.h>
using namespace std;
const int M=1e5+7;
int n,t2;
int a[M];
long long t;
bool b[M];
int cnt[M];
bool cmp(int x,int y)
{
    return x<y;
}
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    sort(a+1,a+n+1,cmp);
    t2=1;
    for(int i=1;i<=n;i++)
    {
        if(i==1)
        {
            cnt[t2]++;
        }
        else if(a[i]==a[i-1])
        {
            cnt[t2]++;
        }
        else
        {
            t2++;
            cnt[t2]++;
        }
    }
    for(int i=1;i<=t2;i++)
    {
        if(cnt[i]>t)
        {
            t=cnt[i];
        }
    }
    cout<<t;
    return 0;
}
